Shunting of Passenger Train Units: an Integrated Approach

In this paper, we describe a new model for the Train Unit Shunting Problem. This model is capable of solving the matching and parking subproblems in an integrated manner, usually requiring a reasonable amount of computation time for generating acceptable solutions. Furthermore, the model incorporates complicating details from practice, such as trains composed of several train units and tracks that can be approached from two sides. Computation times are reduced by introducing the concept of virtual shunt tracks. Computational results are presented for real-life cases of NS Reizigers, the main Dutch passenger railway operator.Optimization;Passenger Railways;Shunting

Crew Rostering for the High Speed Train

At the time of writing we entered the final stage of implementing the crew rostering system Harmony CDR to facilitate the planning of catering crews on board of the Thalys, the High Speed Train connecting Paris, Cologne, Brussels, Amsterdam, and Geneva. Harmony CDR optimally supports the creation of crew rosters in two ways. Firstly, Harmony CDR contains a powerful algorithm to automatically generate a set of rosters, which is especially developed for this specific situation. As the user has some control over the objectives of the algorithm, several scenarios can be studied before a set of rosters is adopted. An important feature of the automatic roster generator is that it respects requirements, directives, and requests stemming from legal, union, and/or company regulations and/or from individual crew. Secondly, Harmony CDR provides user-interface data manipulation at various levels of detail. The user interface enables the planner to easily obtain many different views on the planning data and to manipulate the planning manually. So again, the planner gets optimal support from the system while he or she is still in control. Also, violating a requirement, directive, or request is detected and displayed, but can be accepted by the planner. In this paper we describe the crew rostering problem for the catering crews of the High Speed Train and the Harmony CDR solution in more detail.decision support systems;railways;crew rostering

Shunting of Passenger Train Units in a Railway Station

In this paper we introduce the problem of shunting passenger trainunits in a railway station. Shunting occurs whenever train units aretemporarily not necessary to operate a given timetable. We discussseveral aspects of this problem and focus on two subproblems. Wepropose mathematical models for these subproblems together with asolution method based on column generation. Furthermore, a newefficient and speedy solution technique for pricing problems in columngeneration algorithms is introduced. Finally, we present computationalresults based on real life instances from Netherlands Railways.logistics;column generation;railway optimization;real world application

Operations research in passenger railway transportation

In this paper, we give an overview of state-of-the-art OperationsResearch models and techniques used in passenger railwaytransportation. For each planning phase (strategic, tactical andoperational), we describe the planning problems arising there anddiscuss some models and algorithms to solve them. We do not onlyconsider classical, well-known topics such as timetabling, rollingstock scheduling and crew scheduling, but we also discuss somerecently developed topics as shunting and reliability oftimetables.Finally, we focus on several practical aspects for each of theseproblems at the largest Dutch railway operator, NS Reizigers.passenger railway transportation;operation research;planning problems

Applying Operations Research techniques to planning of train shunting

In this paper, we discuss a model-based algorithmic approach for supporting planners in the creation of shunt plans for passenger trains. The approach provides an example of a mathematical model and a corresponding solution approach for model based support. We introduce a four-step solution approach and we discuss how the planners are supported by this approach. Finally, we present computational results for these steps and give some suggestions for further research.A* search;railway optimization;real world application;routing

Algorithmic Decision Support for Shunt Planning

Eén van de laatste onderdelen van het planningsproces voor het vervoeren van treinreizigers is operationele rangeerplanning. Rangeerplanning richt zich op de logistiek binnen een station en de directe omgeving ervan. De vraag naar transport varieert gedurende de dag en daarom heeft een spoorvervoerder buiten de spits vaak rollend materieel over. Vaak wordt dit overtollig materieel tijdelijk opgesteld op een rangeerterrein zodat de hoofdinfrastructuur gebruikt kan worden door andere treinen. Het toewijzen van aankomend materieel aan vertrekkend materieel, het routeren van materieel door stations, het reinigen van materieel, en personeelsplanning zijn, naast het opstellen, onderdelen van rangeerplanning. "Algoritmische Beslissingsondersteuning voor Rangeerplanning” introduceert de karakteristieken van rangeren en zet een eerste stap in de richting van kwantitatieve modellen en algoritmen voor het ondersteunen van de rangeerplanning. Verschillende algoritmen voor het oplossen van verschillende kwantitatieve modellen lijken in meerdere en mindere mate op de huidige praktijk van rangeerplanners. Rekenresultaten gebaseerd op realistische data laten zien dat goede oplossingen vaak binnen enkele minuten rekentijd worden gevonden. Daarnaast zijn deze algoritmen ontworpen om interactie met rangeerplanners te stimuleren. De algoritmen vormen een solide basis voor een geavanceerd beslissingsondersteunend systeem voor rangeerplanners.One of the last elements of the planning process of a passenger railway operator is operational shunt planning. It focuses on the logistics within a station and its surroundings. Since demand for transportation fluctuates over a day, a railway operator typically has a surplus of rolling stock outside the rush hours, and especially during the night. In general, the idle rolling stock is parked at a shunt yard, thereby keeping the main railway infrastructure available for other train services. Besides parking of rolling stock, matching of arriving to departing rolling stock, routing over local railway infrastructure, cleaning of rolling stock, and crew planning are part of shunt planning. "Algorithmic Decision Support for Shunt Planning" introduces relevant aspects of shunting and provides a first step for quantitative models and algorithms to support shunt planning. The algorithms for solving the models contain algorithms that resemble the current practice of shunt planners as well as algorithms that are somewhat farther away from current practice. Computational tests on real-life data show that high-quality solutions are typically found within minutes of computation time. In addition, these algorithms are designed to interact with shunt planners. They provide a firm basis for an advanced planning system to support shunt planners

Crew Rostering for the High Speed Train

At the time of writing we entered the final stage of implementing the crew rostering system Harmony CDR to facilitate the planning of catering crews on board of the Thalys, the High Speed Train connecting Paris, Cologne, Brussels, Amsterdam, and Geneva. Harmony CDR optimally supports the creation of crew rosters in two ways. Firstly, Harmony CDR contains a powerful algorithm to automatically generate a set of rosters, which is especially developed for this specific situation. As the user has some control over the objectives of the algorithm, several scenarios can be studied before a set of rosters is adopted. An important feature of the automatic roster generator is that it respects requirements, directives, and requests stemming from legal, union, and/or company regulations and/or from individual crew. Secondly, Harmony CDR provides user-interface data manipulation at various levels of detail. The user interface enables the planner to easily obtain many different views on the planning data and to manipulate the planning manually. So again, the planner gets optimal support from the system while he or she is still in control. Also, violating a requirement, directive, or request is detected and displayed, but can be accepted by the planner. In this paper we describe the crew rostering problem for the catering crews of the High Speed Train and the Harmony CDR solution in more detail

Scheduling train crews: a case study for the Dutch Railways

In this paper the problem of scheduling train crew is considered. We discuss a general framework of which the method for solving the train crew scheduling problem is a special case. In particular, our method is a heuristic branch-and-price algorithm suitable for large scale crew scheduling problems. This algorithm is applied to a real life train guard scheduling problem which is provided to us by the Dutch Railways. Computational results show that our algorithm is capable of getting sub-optimal solutions for a large scale instance within reasonable computation time

Shunting of Passenger Train Units: an Integrated Approach

In this paper, we describe a new model for the Train Unit Shunting Problem. This model is capable of solving the matching and parking subproblems in an integrated manner, usually requiring a reasonable amount of computation time for generating acceptable solutions. Furthermore, the model incorporates complicating details from practice, such as trains composed of several train units and tracks that can be approached from two sides. Computation times are reduced by introducing the concept of virtual shunt tracks. Computational results are presented for real-life cases of NS Reizigers, the main Dutch passenger railway operator

A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm

This paper discusses a decision support system for airline and railway crew planning. The system is a state-of-the-art branch-and-price solver that is used for crew scheduling and crew rostering. We briefly discuss the mathematical background of the solver, of which most part is covered in the Operations Research literature. Crew scheduling is crew planning for one or a few days that results in crew duties or pairings, and crew rostering is crew planning for at least one week for individual crew members. Technical issues about the system and its implementation are covered in more detail, as well as several applications. In particular, we focus on